Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squares
نویسندگان
چکیده
منابع مشابه
Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squares
A nonlinear least squares problem with nonlinear constraints may be ill posed or even rank-deficient in two ways. Considering the problem formulated as minx 1/2‖f2(x)‖2 subject to the constraints f1(x) = 0, the Jacobian J1 = ∂f1/∂x and/or the Jacobian J = ∂f/∂x, f = [f1; f2], may be ill conditioned at the solution. We analyze the important special case when J1 and/or J do not have full rank at ...
متن کاملLocal Results for the Gauss-newton Method on Constrained Rank-deecient Nonlinear Least Squares
A nonlinear least squares problem with nonlinear constraints may be ill posed or even rank-deecient in two ways. Considering the problem formulated as min x 1=2kf 2 (x)k 2 2 subject to the constraints f 1 (x) = 0, the Jacobian J 1 = @f 1 =@x and/or the Jacobian J = @f=@x, f = f 1 ; f 2 ], may be ill conditioned at the solution. We analyze the important special case when J 1 and/or J do not have...
متن کاملApproximate Gauss-Newton Methods for Nonlinear Least Squares Problems
The Gauss–Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...
متن کاملGauss-Seidel Iterative Methods for Rank Deficient Least Squares Problems
We study the semiconvergence of Gauss-Seidel iterative methods for the least squares solution of minimal norm of rank deficient linear systems of equations. Necessary and sufficient conditions for the semiconvergence of the Gauss-Seidel iterative method are given. We also show that if the linear system of equations is consistent, then the proposed methods with a zero vector as an initial guess ...
متن کاملGlobal Convergence of a New Hybrid Gauss--Newton Structured BFGS Method for Nonlinear Least Squares Problems
In this paper, we propose a hybrid Gauss-Newton structured BFGS method with a new update formula and a new switch criterion for the iterative matrix to solve nonlinear least squares problems. We approximate the second term in the Hessian by a positive definite BFGS matrix. Under suitable conditions, global convergence of the proposed method with a backtracking line search is established. Moreov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2003
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-03-01611-9